Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Graph simple")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 193

  • Page / 8
Export

Selection :

  • and

Cutpoints and the chromatic polynomialWHITEHEAD, E. G. JR; LIAN-CHANG ZHAO.Journal of graph theory. 1984, Vol 8, Num 3, pp 371-377, issn 0364-9024Article

PROPERTIES OF UNIQUE REALIZATIONS: A SURVEYJOHNSON RH.1980; DISCRETE MATH.; NLD; DA. 1980; VOL. 31; NO 2; PP. 185-192; BIBL. 9 REF.Article

An inequality for degree sequencesSZEKELY, L. A; CLARK, L. H; ENTRINGER, R. C et al.Discrete mathematics. 1992, Vol 103, Num 3, pp 293-300, issn 0012-365XArticle

FINITE HOMOGENEOUS SIMPLE DIGRAPHSLACHLAN AH.1982; STUD. LOG. FOUND. MATH.; ISSN 0049-237X; NLD; DA. 1982; VOL. 107; PP. 189-208; BIBL. 15 REF.Conference Paper

NON-HAMILTONIAN SIMPLE PLANAR GRAPHSZAKS J.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; VOL. 60; PP. 255-263; BIBL. 24 REF.Article

ON THE EDGE-RECONSTRUCTION OF GRAPHS WHICH TRIANGULATE SURFACESFIORINI S; LAURI J.1982; G.J. MATH.; ISSN 0033-5606; GBR; DA. 1982; VOL. 33; NO 130; PP. 191-214; BIBL. 16 REF.Article

THE RELATIONSHIP BETWEEN FIXING SUBGRAPHS AND SMOOTHLY EMBEDDABLE SUBGRAPHSCHIDZEY K.1978; J. AUSTR. MATH. SOC., A; AUS; DA. 1978; VOL. 26; NO 3; PP. 353-367; BIBL. 6 REF.Article

NOTE ON 2-CONNECTED GRAPHS WITH D(U)+D(V) >OU= N-4JUNG HA; NARA C.1982; ARCH. MATH.; ISSN 0003-889X; CHE; DA. 1982; VOL. 39; NO 4; PP. 383-384; BIBL. 3 REF.Article

Disjoint triangles and quadrilaterals in a graphJIN YAN.Discrete mathematics. 2008, Vol 308, Num 17, pp 3930-3937, issn 0012-365X, 8 p.Article

The reconstruction conjecture and edge idealsDALILI, Kia; FARIDI, Sara; TRAVES, Will et al.Discrete mathematics. 2008, Vol 308, Num 10, pp 2002-2010, issn 0012-365X, 9 p.Article

On the number of independent chorded cycles in a graphFINKEL, Daniel.Discrete mathematics. 2008, Vol 308, Num 22, pp 5265-5268, issn 0012-365X, 4 p.Article

Genus bounds for embeddings with large minimum degree and representativityPLUMMER, Michael D; XIAOYA ZHA.Discrete mathematics. 2002, Vol 249, Num 1-3, pp 167-178, issn 0012-365XConference Paper

A note on large cayley graphs of diameter two and given degreeSIAGIOVA, Jana; SIRAN, Jozef.Discrete mathematics. 2005, Vol 305, Num 1-3, pp 379-382, issn 0012-365X, 4 p.Article

Simply sequentially additive labelings of 2-regular graphsHAJNAL, Péter; NAGY, Gábor.Discrete mathematics. 2010, Vol 310, Num 4, pp 922-928, issn 0012-365X, 7 p.Article

Resolvable packings RMP(3, 2; n, n - 3) and coverings RMC(3,2;n,n - 2)CAO, H.Discrete mathematics. 2006, Vol 306, Num 12, pp 1240-1246, issn 0012-365X, 7 p.Article

Independent triangles covering given vertices of a graphHAO LI; JIANPING LI.Theoretical computer science. 2001, Vol 263, Num 1-2, pp 333-344, issn 0304-3975Article

A characterization of unimodular orientations of simple graphsBOUCHET, A.Journal of combinatorial theory. Series B. 1992, Vol 56, Num 1, pp 45-54, issn 0095-8956Article

KONSTRUKTION SCHLICHTER TRANSITIVER GRAPHEN MIT MAXIMALER AUZAHL EINFACHER EIGENWERTE = CONSTRUCTION DE GRAPHES TRANSITIFS SIMPLES AVEC LE NOMBRE MAXIMUM DE VALEURS PROPRES SIMPLESSACHS H; STIEBITZ M.1981; MATH. NACHR.; ISSN 0323-5572; DDR; DA. 1981; VOL. 100; PP. 145-150; BIBL. 7 REF.Article

KNESER REPRESENTATIONS OF GRAPHSHAMBURGER, Peter; POR, Attila; WALSH, Matt et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 2, pp 1071-1081, issn 0895-4801, 11 p.Article

Edge-connectivity of regular graphs with two orbitsFENGXIA LIU; JIXIANG MENG.Discrete mathematics. 2008, Vol 308, Num 16, pp 3711-3716, issn 0012-365X, 6 p.Article

Some topological properties of folded Petersen graphXUEGONG TAN; JIN HAN PARK.Discrete mathematics. 2008, Vol 308, Num 20, pp 4786-4790, issn 0012-365X, 5 p.Article

The largest eigenvalue of unicyclic graphsSHENGBIAO HU.Discrete mathematics. 2007, Vol 307, Num 2, pp 280-284, issn 0012-365X, 5 p.Article

Optimal pebbling of graphsMUNTZ, Jessica; NARAYAN, Sivaram; STREIB, Noah et al.Discrete mathematics. 2007, Vol 307, Num 17-18, pp 2315-2321, issn 0012-365X, 7 p.Article

On σ-polynomials and a class of chromatically unique graphsQINGYAN DU.Discrete mathematics. 1993, Vol 115, Num 1-3, pp 153-165, issn 0012-365XArticle

The existence of k-factors in squares of graphsFOURTOUNELLI, Olga; KATERINIS, P.Discrete mathematics. 2010, Vol 310, Num 23, pp 3351-3358, issn 0012-365X, 8 p.Article

  • Page / 8